Abstract Debugging of Logic Programs
نویسندگان
چکیده
Debugging of Logic Programs Marco Comini Giorgio Levi Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125 Pisa, Italy {comini, levi}@di.unipi.it
منابع مشابه
A Type Based Debugging Tool for Untyped Logic Languages
This paper presents a method for debugging type errors in untyped logic programs by generating type information based on abstract interpretation with OLDT resolution. The notion \type" is extended to enable the phenomena in logic programs to be described more precisely. The classes Single Types and Collected Types are introduced. An extended OLDT resolution performs combination of derived singl...
متن کاملEfficient Detection of Incompleteness Errors in the Abstract Debugging of Logic Programs
Abstract debugging of logic programs is an extension of declarative debugging, where we deal with specifications of operational properties, which can be characterized as abstractions of SLD-trees (observables). We introduce a simple and efficient method to detect incompleteness errors, which is based on the application of the immediate consequences operator to the specification. The method is p...
متن کاملAbstract Verification and Debugging of Constraint Logic Programs
Verification and Debugging of Constraint Logic Programs Manuel Hermenegildo, Germán Puebla, Francisco Bueno, and Pedro López-Garćıa {herme,german,bueno,pedro}@fi.upm.es Department of Computer Science Technical University of Madrid (UPM)
متن کاملDeclarative Debugging of Functional Logic Programs
We present a general framework for the declarative debugging of functional logic programs, which is valid both for eager as well as lazy programs. We associate with our programs a semantics based on a (continuous) immediate consequence operator which models computed answers. Then we show that, given the intended speciication of a program P, it is possible to check the correctness of P by a sing...
متن کاملDeclarative Diagnosis of Temporal Concurrent Constraint Programs
We present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous) immediate consequence operator, TD, which models the process behaviour associated with a program D given in terms of sequences of constraints. Then, we show that, given the intended specification of D, it is possible to check ...
متن کامل